//package de.fuberlin.inf.alp2;
//
//public class testLoop {
//
//	/**
//	 * @param args
//	 */
//	public static void main(String[] args) {
//		
//		int int_a;
//		byte byte_b = 10;
//		float float_c = 4.3f;
//		long long_d = 5;
//		short short_e = 4;
//		char char_f = 'a';
//		boolean bool_g = true;
//		int Null = 4;
//		int_a = 25 + byte_b;
//		long_d = int_a + byte_b;
//		bool_g = (char_f > (char) byte_b);
//		--int_a;
//		float_c = (float) (1 + 0.5);
//		int_a = 0xC0B0;
////		// a
//		int xj = 4;
//		int xk = 3;
//		int xi = 0;
////		for (int j = xj; j > 0; j--)
////		{
////			for (int k = xk; k > 0; k--)
////			{
////				xi = xi + 1;
////			}
////		}
////		System.out.println(xi);
////		
////		// b
//		int xl = 0;
////		xi = 5;
////		xj = 1;
////		xk = 1;
////		for (int i = xi; i > 0; i--)
////		{
////			xl = 0;
////			for (int j = xj; j > 0; j--)
////			{
////				for (int k = xk; k > 0; k--)
////				{
////					xl = xl + 1;
////				}
////			}
////			xj = xl;
////			xk = xk + 1;
////		}
////		System.out.println(xl);
////		
////		// c
////		xi = 12;
////		xk = 18;
////		while (xk != 0)
////		{
////			xi = xi + 1;
////			xk = xk - 1;
////		}
////		System.out.println(xi);
////		
////		xi = 18;
////		xk = 12;
////		while (xk != 0)
////		{
////			xi = xi - 1;
////			xk = xk - 1;
////		}
////		System.out.println(xi);
////		
////		// d
//		int xm, xn, xo;
////		xi = 0;
////		xj = 10000;
////		xk = 5000;
////		xl = 1;
////		for (int j = xj; j > 0; j--)
////		{
////			xm = 0;
////			for (int k = xk; k > 0; k--)
////			{
////				for (int l = xl; l > 0; l--)
////				{
////					xm = xm + 1;
////				}
////			}
////			xo = 1;
////			xn = xm;
////			for (int j2 = xj; j2 > 0; j2--)
////			{
////				xn = xn - 1;
////			}
////			for (int n = xn; n > 0; n--)
////			{
////				xo = 0;
////			}
////			xn = xj;
////			for (int m = xm; m > 0; m--)
////			{
////				xn = xn - 1;
////			}
////			for (int n = xn; n > 0; n--)
////			{
////				xo = 0;
////			}
////			for (int o = xo; o > 0; o--)
////			{
////				xi = 1;
////			}
////			xl = xl + 1;
////		}
////		System.out.println(xi);
//		
//		// e
////		xi = 5;
////		xm = 100;
////		xn = xi;
////		xj = xm;
////		int xp;
////		// while (m > n)
////		// solange m größer n
////		// wenn m größer n, dann m - n != 0, sonst null
////		// dekrementiere m genau n mal (m muss gleich n sein, damit hier 0 raus kommt)
////		for (int n = xn; n > 0; n--)
////		{
////			xj = dec(xj);
////		}
////		for (xm = ) // while (m > n)
////		{
////			xp = 1;
////			// hier wird das programm ablaufen und das ergebnis in xo speichern
////			xo = 4;
////			while (xo != 0) // if (xo != 0)
////			{
////				xp = 0;
////				xo = 0;
////			}
////			while (xp != 0) // else
////			{
////				
////			}
////		}
////		
//		
////		// f
////		xj = 5; // dividend
////		xk = 0; // divisor
////		xi = 0;
////		xm = 0;
////		xo = xj;
////		// führe xj mal aus
////		while (xo != 0)
////		{
////			// addiere xk zu xm 
////			xl = xk;
////			while (xl != 0) {
////				xm = xm + 1;
////				xl = dec(xl);
////			}
////			// xi-ter schleifendurchlauf
////			xi = xi + 1;
////			xn = xm;
////			xo = xj;
////			xo = xo + 1;
////			// wenn xj > xm, dann wird nicht null
////			// dekrementiere xj xm mal
////			while (xn != 0) {1
////				xo = dec(xo);
////				xn = dec(xn);
////			}
////		}
////		xi = dec(xi);
////		
////		System.out.println(xi);
//		
////		xj = 9;
////		xk = 10;
////		
////		xl = xj;
////		xm = xk;
////		xm = dec(xm);
////		xn = xl;
////		// xj muss größer/gleich sein als xk
////		// xj muss größer sein als xk-1
////		// also darf xj - (xk-1) nicht 0 ergeben
////		// dekrementiere also xj (xk-1) mal
////		// subtrahiere (xk-1) von xj und speicher das ergebnis in xn
////		while (xm != 0) {
////			xm = dec(xm);
////			xn = dec(xn); // dekrementiere xj
////		}
////		// wenn xj größer/gleich xk war, ist xn != 0
////		// also while (xj >= xk)
////		while (xn != 0) {
////			// subtrahiere xk von xl (ehemals xj)
////			xo = xk;
////			while (xo != 0) {
////				xl = dec(xl); // dekrementiere xl
////				xo = dec(xo);
////			}
////			// xl muss für die nächste Ausführung größer/gleich xk sein
////			// xl muss also größer als (xk-1) sein
////			// also darf xl - (xk-1) nicht 0 ergeben
////			// dekrementiere also xl (xk-1) mal
////			xm = xk;
////			xm = dec(xm);
////			xn = xl;
////			while (xm != 0) {
////				xm = dec(xm);
////				xn = dec(xn); // dekrementiere xk
////			}
////			// wenn xl größer als xk war, ist das ergebnis != 0
////		}
////		System.out.println(xl);
//	}
//	
//	public static int dec(int i){
//		if (i!=0) i--;
//		return i;
//	}
//	
//
//}
